Experience with an Easily Computed Metric for Ranking Alternative Parses

Tree Kernels for Semantic Role Labeling

The availability of large scale data sets of manually annotated predicate–argument structures has recently favored the use of machine learning approaches to the design of automated semantic role labeling (SRL) systems. The main research in this area relates to the design choices for feature representation and for effective decompositions of the task in different learning models. Regarding the f...

Ranking DMUs by New Metric DTM with Fuzzy Data in DEA

Alternative ranking method in Dynamic Data Envelopment Analysis (DDEA)

The motivation of this paper is to propose such equitable method for ranking all decision making units (DMUs) in dynamic Data Envelopment Analysis (DDEA) framework. As far as we are aware there is not more studies in dynamic DEA literature. What's more, in such cases the best operating unit is important to be sampled for the others in under evaluated time periods. However, in this special conce...

An alternative transformation in ranking using l1-norm in data envelopment analysis

Jahanshahloo et al. (Appl Math Comput 153:215–224, 2004) propose a method for ranking extremely efficient decision making units (DMUs) in data envelopment analysis (DEA) using super-efficiency technique and l1-norm and they show that the presented method is able to eliminate the existing difficulties in some methods. This paper suggests an alternative transformation to convert the nonlinear mod...

Fixed point results for Ʇ_Hθ- contractive mappings in orthogonal metric spaces

The main purpose of this research is to extend some fixed point results in orthogonal metric spaces. For this purpose, first, we investigate new mappings in this spaces. We introduce the new notions of functions. Then by using it, we define contractive mappings and then we establish and prove some fixed point theorems for such mappings in orthogonal metric spaces. Then by utilizing examples of ...